Minimum Storage Regenerating Codes for All Parameters

Enabling All-Node-Repair in Minimum Storage Regenerating Codes

We consider the problem of constructing exact-repair minimum storage regenerating (MSR) codes, for which both the systematic nodes and parity nodes can be repaired optimally. Although there exist several recent explicit high-rate MSR code constructions (usually with certain restrictions on the coding parameters), quite a few constructions in the literature only allow the optimal repair of syste...

Hybrid Regenerating Codes for Distributed Storage Systems

Distributed storage systems are mainly justified due to their ability to store data reliably over some unreliable nodes such that the system can have long term durability. Recently, regenerating codes are proposed to make a balance between the repair bandwidth and the storage capacity per node. This is achieved through using the notion of network coding approach. In this paper, a new variation ...

Searching for Minimum Storage Regenerating Codes

Regenerating codes allow distributed storage systems to recover from the loss of a storage node while transmitting the minimum possible amount of data across the network. We present a systematic computer search for optimal systematic regenerating codes. To search the space of potential codes, we reduce the potential search space in several ways. We impose an additional symmetry condition on cod...

Functional Minimum Storage Regenerating Codes For Multi-Cloud Failure

Generalization of Rashmi-Shah-Kumar Minimum-Storage-Regenerating Codes

In this paper, we propose a generalized version of the Rashmi-Shah-Kumar Minimum-Storage-Regenerating(RSKMSR) codes based on the product-matrix framework. For any (n, k, d) such that d ≥ 2k − 2 and d ≤ n − 1, we can directly construct an (n, k, d) MSR code without constructing a larger MSR code and shortening of the larger MSR code. As a result, the size of a finite field over which the propose...